Lightweight Delegatable Proofs of Storage to Avoid Data Spillage using AVL Tree
نویسندگان
چکیده
منابع مشابه
Lightweight Delegatable Proofs of Storage
Proofs of storage (including Proofs of Retrievability and Provable Data Possession) is a cryptographic tool, which enables data owner or third party auditor to audit integrity of data stored remotely in a cloud storage server, without keeping a local copy of data or downloading data back during auditing. We observe that all existing publicly verifiable POS schemes suffer from a serious drawback...
متن کاملLightweight and Privacy-Preserving Delegatable Proofs of Storage
Proofs of storage (POR or PDP) is a cryptographic tool, which enables data owner or third party auditor to audit integrity of data stored remotely in a cloud storage server, without keeping a local copy of data or downloading data back during auditing. We observe that all existing publicly verifiable POS schemes suffer from a serious drawback: It is extremely slow to compute authentication tags...
متن کاملIn-memory URL Compression using AVL Tree
A common problem of large scale search engines and web spiders is how to handle a huge number of encountered URLs. Traditional search engines and web spiders use hard disk to store URLs without any compression. This results in slow performance and more space requirement. This paper describes a simple URL compression algorithm allowing efficient compression and decompression. The compression alg...
متن کاملDecision Tree Induction : An Approach for Data Classification Using AVL - Tree
Classification is considered to be one of the important building blocks in data mining problem. The major issues concerning data mining in large databases are efficiency and scalability. This paper addresses these issues by proposing a data classification method using AVL trees, which enhances the quality and stability. Researchers from various disciplines such as statistics, machine learning, ...
متن کاملRandomizable Proofs and Delegatable Anonymous Credentials
We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other users, and prove possession of a credential L levels away from a given authority. The size of the proof (and time to compute it) is O(Lk), where k is the security parameter. The only other construction of delegatable ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal for Research in Applied Science and Engineering Technology
سال: 2019
ISSN: 2321-9653
DOI: 10.22214/ijraset.2019.5553